Improved Adaptive Routing Algorithm in Distributed Data Centers
نویسندگان
چکیده
منابع مشابه
Compact Distributed Data Structures for Adaptive Routing
In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors' local memory as succinct as possible. The eeciency of a routing scheme is measured in terms of its stretch factor-the maximum ratio between the cost of a route computed by the scheme and that of a cheape...
متن کاملAdaptive Routing algorithm to support Distributed Services in WiMAX
IEEE 802.16 technology has emerged as a cost effective solution to Internet broadband access for stationary and mobile hosts. To efficiently support the large number of customers in the WiMAX network, the network can be enabled with distributed services. This paper presents an adaptive routing algorithm for computing bandwidth guaranteed paths using disciplined flooding and proxy setup to suppo...
متن کاملUse of the Improved Frog-Leaping Algorithm in Data Clustering
Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...
متن کاملAn improved distributed routing algorithm for Benes based optical NoC
Integrated optical interconnect is believed to be one of the main technologies to replace electrical wires. Optical Network-on-Chip (ONoC) has attracted more attentions nowadays. Benes topology is a good choice for ONoC for its rearrangeable non-blocking character, multistage feature and easy scalability. Routing algorithm plays an important role in determining the performance of ONoC. But trad...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Electronic Engineering
سال: 2017
ISSN: 1804-3119,1336-1376
DOI: 10.15598/aeee.v15i3.2185